Separable functors in coalgebras. Applications
نویسندگان
چکیده
منابع مشابه
Functors for Coalgebras
Functors preserving weak pullbacks provide the basis for a rich structure theory of coalgebras. We give an easy to use criterion to check whether a functor preserves weak pullbacks. We apply the characterization to the functor F which associates a set X with the set F(X) of all filters on X. It turns out that this functor preserves weak pullbacks, yet does not preserve weak generalized pullback...
متن کاملSeparable functors in corings
We develop some basic functorial techniques for the study of the categories of comodules over corings. In particular, we prove that the induction functor stemming from every morphism of corings has a left adjoint, called ad-adjoint functor. This construction generalizes the known adjunctions for the categories of Doi-Hopf modules and entwining structures. The separability of the induction and a...
متن کاملRecursive coalgebras of finitary functors
For finitary set functors preserving inverse images several concepts of coalgebras A are proved to be equivalent: (i) A has a homomorphism into the initial algebra, (ii) A is recursive, i.e., A has a unique coalgebra-to-algebra morphism into any algebra, and (iii) A is parametrically recursive. And all these properties mean that the system described by A always halts in finitely many steps.
متن کاملSeparable Functors for the Category of Doi-hopf Modules. Applications
We prove a Maschke type Theorem for the category of Doi-Hopf modules. In fact, we give necessary and sufficient conditions for the functor forgetting the C-coaction to be separable. This leads to a generalized notion of integrals. Our results can be applied to obtain Maschke type Theorems for Yetter-Drinfel’d modules, Long dimodules and modules graded by G-sets. Existing Maschke type Theorems d...
متن کاملWeak Bisimulations for Coalgebras over Ordered Functors
The aim of this paper is to introduce a coalgebraic setting in which it is possible to generalize and compare the two known approaches to defining weak bisimulation for labelled transition systems. We introduce two definitions of weak bisimulation for coalgebras over ordered functors, show their properties and give sufficient conditions for them to coincide. We formulate a weak coinduction prin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tsukuba Journal of Mathematics
سال: 1997
ISSN: 0387-4982
DOI: 10.21099/tkbjm/1496163245